Authenticated teleportation with one-sided trust

One-Sided Interval Trees

We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.

Popular Matchings with Two-Sided Preferences and One-Sided Ties

We are given a bipartite graph G = (A ∪ B,E) where each vertex has a preference list ranking its neighbors: in particular, every a ∈ A ranks its neighbors in a strict order of preference, whereas the preference lists of b ∈ B may contain ties. A matching M is popular if there is no matching M ′ such that the number of vertices that prefer M ′ to M exceeds the number that prefer M to M ′. We sho...

Log-Structure Authenticated Data Storage with Minimal Trust

Today, data outsourcing to the clouds is a popular computing paradigm, and enabling efficient and trustworthy outsourcing becomes critically important as many emerging cloud applications are increasingly security-sensitive, such as healthcare, finance, etc. One of the promising techniques is authentication data structure (ADS). Most existing ADSs are not log-structured, yet cloud storage system...

One - sided Versus Two - sided Error in

On one-sided versus two-sided classification

One-sided classiiers are computable devices which read the characteristic function of a set and output a sequence of guesses which converges to 1 ii the set on the input belongs to the given class. Such a classiier is two-sided if the sequence of its output in addition converges to 0 on sets not belonging to the class. The present work obtains the below mentioned results for one-sided classes (...